Location:
Search - Heuristic star
Search list
Description: 8数码问题的Java求解，采用A*算法。数据结构采用的Vector<int[]>。输出为"no solution"或一系列表示求解过程的字符串。
某些30步的测试样例需要半分钟左右，但是绝对是正确解~~万望您能不吝点滴时间耐心等待……orz thnx~~
我用的启发函数计算了现在的网格距离目标网格还有多远。
具体算法是，将每一格中的数字的坐标与其应该在的坐标的差加到一起，得到这个最终值h(x)
也就是Manhattan_Distance
源码使用方法：建立Java Project后，分别建立三个同名的.java文件，将源码分别复制过去然后编译运行即可。-a source code that solves the 8 puzzle problem. it uses A-star algorithm, and a major data structure of Vector<int[]>. The output of the program would be "no solution" or a series of strings representing the moves during the solution.
Well, some samples need to be proceeded for around 30 seconds, but the program per se is indeed correct and will ultimately generate the shortest solution. so if u encounter such occasion plz jst wait for a while tho~~~ thnx~!!
the heuristic function, say h(x), in this source code is the sum of the Mahattan Distance of each block from its destination block.
How to use: build a Java Project, and create three .java files with the same names in the .zip file accordingly, and copy the source from the .zip file and just compile and run~~!
have fun thnx~!
Platform: |
Size: 669696 |
Author: Siegfried |
Hits:
Description: A星算法+强启发函数解八数码问题，自带判断是否有解-A Star Algorithm+ strong heuristic function solution of 8 digital issues, bring their own to determine whether the broken
Platform: |
Size: 989184 |
Author: 胡茂名 |
Hits:
Description: A*算法，启发式路径搜索（星际，帝国等即时战略游戏中AI寻路）-A* algorithm, heuristic path search (Star, Imperial and other real-time strategy game AI pathfinding)
Platform: |
Size: 403456 |
Author: 赵鹏 |
Hits:
Description: 基于启发式收索的A算法，A星算法的C++类的完整实现源代码-A collection of cable based on heuristic algorithms, A star algorithm in C++ source code for the complete implementation of class
Platform: |
Size: 3072 |
Author: wangzhenjun |
Hits:
Description: 15 puzzle
A star
Heuristic
Platform: |
Size: 229376 |
Author: Yuekui Ruan |
Hits:
Description: 利用A星算法解决迷宫问题，用到了耗散函数，即启发式的h-A star algorithm to solve the maze, use the dissipation function, that is, heuristic h
Platform: |
Size: 1024 |
Author: 张强 |
Hits:
Description: A* A星算法， 经典的启发式寻求最短路径的算法，启发函数采用最简单的曼哈顿法，从OPEN表中选出最小的f值的点采用堆排序，里面注释很多，谢谢，共同学习！-A* A Star algorithm, classical heuristic seeks the shortest path algorithm, heuristic function takes the simplest Manhattan method selected from the OPEN statement smallest f-value point using heap sort, which notes a lot, thank you, learn together!
Platform: |
Size: 8192 |
Author: 彭陶 |
Hits:
Description: A星寻路算法。FlashDevelop开发环境.用曼哈顿启发函数-A Star pathfinding algorithm. FlashDevelop development environment with Manhattan heuristic function
Platform: |
Size: 1417216 |
Author: |
Hits:
Description: 区别于以往传统最短路算法，如：Dijkstra算法或者Floyd算法。该算法为启发式最短路径搜寻算法：A STAR-Finding the shortest path: a heuristic algorithm named A STAR
Platform: |
Size: 18432 |
Author: 覃文 |
Hits:
Description: C++ A星算法实现八数码问题，启发函数为每一个将牌与其目标位置之间距离（不考虑夹在其间的将牌）的总和。-C++ A star algorithm eight digital, distance heuristic function sum (without considering sandwiched therebetween trump) between each of the brand to its target location
Platform: |
Size: 3072 |
Author: 张阳 |
Hits:
Description: A星算法解决8数码问题,一种启发式搜索程序-A star algorithm to solve 8 digital problem, a heuristic search procedures
Platform: |
Size: 3072 |
Author: 王勇 |
Hits:
Description: 一个用C语言写的迷宫游戏
定义一个8*8的格子，这64个格子是人物可以移动到的位置；障碍物定义为两个相邻格子之间的挡板，0或1两种状态。类似上述方法，可以定义整个迷宫的布局，64个格子，对应数目的挡板，迷宫出口，迷宫入口，小人，这些元素。
文件里，需要存储迷宫大小，挡板位置，出口，入口。
小人在任一位置，可以向四个方向移动，有挡板则可以移动，没挡板则不可以移动。
最优路径的提示，使用A星路径算法去做，实质是一个启发式广度优先遍历。-A written in C language maze game
The definition of a 8x8 grid, which is a character grid 64 can be moved to the position the obstacle is defined as a baffle between two adjacent grid, 0 or 1 two states. Similar to the above method, you can define the entire layout of the maze, 64 grid, a corresponding number of baffles, exit the maze, the maze entrance, villain, these elements.
File, the need to store the size of the maze, damper position, export, import.
Villain in either position, you can move in four directions, you can move baffled, did not baffle can be moved.
Tip optimal path using A star path algorithm to do, in essence, it is a heuristic breadth-first traversal.
Platform: |
Size: 3072 |
Author: ShichaoLiang |
Hits:
Description: A star search which finds the most optimal location to go to a vertex/node a given node. It uses a heuristic function. This program is located at Artificial intelligence a modern approach page 97.-A star search which finds the most optimal location to go to a vertex/node a given node. It uses a heuristic function. This program is located at Artificial intelligence a modern approach page 97.
Platform: |
Size: 2048 |
Author: sajib_arefin |
Hits:
Description: 运用启发式搜索算法，用来解决一个简单的八数码问题。这里用的是A星算法。-Using heuristic search algorithm, which is used to solve a simple eight digital problem. Here is A star algorithm.
Platform: |
Size: 933888 |
Author: 武林 |
Hits:
Description: c++ AI project artificial intelligence path planning route best first a * star * greedy first uniform cost dijkstra s optimal search heuristic incomplete project not working fully
Platform: |
Size: 224256 |
Author: |
Hits:
Description: A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(A * search algorithm commonly known as A Star algorithm. A * algorithm is one of the more popular heuristic search algorithms and is widely used in the field of path optimization. It is unique in that it examines every possible node in the shortest path by introducing global information, estimating the distance from the end of the current node, and serving as a measure of the likelihood of the node being on the shortest path.)
Platform: |
Size: 5120 |
Author: diuman |
Hits:
Description: A星算法 应用于路径优化算法 是一种具有启发性策略的算法 本文对a星算法进行介绍与总结 并用java语言实现！(The application of A star algorithm to the path optimization algorithm is an heuristic strategy. This paper introduces and summarizes the a star algorithm and implements it in the Java language.)
Platform: |
Size: 28672 |
Author: fffry |
Hits:
Description: A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(The A* search algorithm is commonly known as the A-star algorithm. The A* algorithm is one of the more popular heuristic search algorithms and is widely used in the field of path optimization [. It is unique in that it introduces global information when examining every possible node in the shortest path, estimates the distance from the current node to the end point, and serves as a measure of the probability that the node is on the shortest route.)
Platform: |
Size: 724992 |
Author: xiaoqiangzi |
Hits: